Randomized Algorithms and Complexity Theory
نویسنده
چکیده
In this paper we give an introduction to the connection between complexity theory and the study of randomized algorithms. In particular, we will define and study probabilistic complexity classes, survey the basic results, and show how they relate to the notion of randomized algorithms.
منابع مشابه
Towards a Theory of Randomized Search Heuristics
There is a well-developed theory about the algorithmic complexity of optimization problems. Complexity theory provides negative results which typically are based on assumptions like NP 6=P or NP 6=RP. Positive results are obtained by the design and analysis of clever algorithms. These algorithms are well-tuned for their specific domain. Practitioners, however, prefer simple algorithms which are...
متن کاملRandomness and non-uniformity
In the first part, we introduce randomized algorithms as a new notion of efficient algorithms for decision problems. We classify randomized algorithms according to their error probabilities, and define appropriate complexity classes. (RP, coRP, ZPP, BPP, PP). We discuss which classes are realistic proposals for design of probabilistic algorithms. We cover the implementation of randomized algori...
متن کاملTheory of Randomized Computation A Survey for CSG714
Randomized algorithms are now common in nearly all areas of computer science. The ability to make random choices has been shown to both simplify algorithms and improve their running times. The success of randomized algorithms in efficiently solving problems for which no known deterministic algorithm exists has fueled theoretical research in the area of probabilistic computation. We present the ...
متن کاملRandomized Algorithm For 3-Set Splitting Problem and it's Markovian Model
In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...
متن کاملNumerical Analysis on a Quantum Computer
We give a short introduction to quantum computing and its relation to numerical analysis. We survey recent research on quantum algorithms and quantum complexity theory for two basic numerical problems – high dimensional integration and approximation. Having matching upper and lower complexity bounds for the quantum setting, we are in a position to compare them with those for the classical deter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. UCS
دوره 12 شماره
صفحات -
تاریخ انتشار 2006